FPT algorithms for path-transversal and cycle-transversal problems
نویسندگان
چکیده
منابع مشابه
Kernelization for Cycle Transversal Problems
We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k kernel for 4-cycle transversal and a O(k) kernel for s-cycle transversal when s > 4. We prove the NP-completeness of s-cycle transversal on planar graphs and obtain a 74k kernel for 4-cycle transversal on planar graphs. We also give several kernelization results for a related problem ...
متن کاملParallel algorithms for generalized clique transversal problems
The K `-clique transversal problem is to locate a minimum collection of cliques of size ` in a graph G such that every maximal clique of sizè in G contains at least one member of the collection. We give an NC algorithm to solve this problem on strongly chordal graphs.
متن کاملCharacterizations of Transversal and Fundamental Transversal Matroids
A result of Mason, as refined by Ingleton, characterizes transversal matroids as the matroids that satisfy a set of inequalities that relate the ranks of intersections and unions of nonempty sets of cyclic flats. We prove counterparts, for fundamental transversal matroids, of this and other characterizations of transversal matroids. In particular, we show that fundamental transversal matroids a...
متن کاملFPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
In this article, we consider problems on graphs of the following form: given a graph, remove p edges/vertices to achieve some property. The first kind of problems are separation problems on graphs, where we aim at separating distinguished vertices in a graph. The second kind of problems are feedback set problems on group-labelled graphs, where we aim at breaking nonnull cycles in a graph. We ob...
متن کاملTransversal Lattices
A flat of a matroid is cyclic if it is a union of circuits; such flats form a lattice under inclusion and, up to isomorphism, all lattices can be obtained this way. A lattice is a Tr-lattice if all matroids whose lattices of cyclic flats are isomorphic to it are transversal. We investigate some sufficient conditions for a lattice to be a Tr-lattice; a corollary is that distributive lattices of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2011
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2010.05.003